Lower bounds on cube simplexity
نویسندگان
چکیده
منابع مشابه
Lower bounds for the simplexity of the n-cube
In this paper we prove a new asymptotic lower bound for theminimal number of simplices in simplicial dissections of n-dimensional cubes. In particular we show that the number of simplices in dissections of n-cubes without additional vertices is at least (n + 1) n−1 2 . © 2012 Elsevier B.V. All rights reserved.
متن کاملA Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes
Let T(n) denote the number of n-simplices in a minimum cardinality decomposition of the n-cube into n-simplices. For n 1 we show that T(n) H(n), where H(n) is the ratio of the hyperbolic volume of the ideal cube to the ideal regular simplex. H(n) 1 2 6 n=2 (n+1) ? n+1 2 n!. Also lim n!1 p nH(n)] 1=n 0:9281. Explicit bounds for T(n) are tabulated for n 10, and we mention some other results on hy...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملLower bounds on kernelization
Preprocessing (data reduction or kernelization) to reduce instance size is one of the most commonly deployed heuristics in the implementation practice to tackle computationally hard problems. However, a systematic theoretical study of them remained elusive so far. One of the reasons for this is that if an input to an NP -hard problem can be processed in polynomial time to an equivalent one of s...
متن کاملTwo lower bounds on
The lower bounds on communication complexity measures of language generation by Parallel Communicating Grammar Systems (PCGS) are investigated. The rst result shows that there exists a language that can be generated by some dag-PCGS (PCGS with communication structures realizable by directed acyclic graphs) consisting of 3 grammars, but by no PCGS with tree communication structure. The second re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90020-5